(ns com.yawmark.euler.clj.e5)

(use '[clojure.contrib.math :only (lcm)])
;; 2520 is the smallest number that can be divided by each of
;; the numbers from 1 to 10 without any remainder. What is the
;; smallest positive number that is evenly divisible by all of
;; the numbers from 1 to 20?

(defn euler-5 [] (reduce lcm (range 2 20)))

(println (time (euler-5)))
